Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

نویسندگان

  • Shuli Sun
  • Haoran Bao
  • Minghui Liu
  • Yuan Yuan
چکیده

The concept of optimal Delaunay triangulation (ODT) and the corresponding error-based quality metric are first introduced. Then one kind of mesh smoothing algorithm for tetrahedral mesh based on the concept of ODT is examined. With regard to its problem of possible producing illegal elements, this paper proposes a modified smoothing scheme with a constrained optimization model for tetrahedral mesh quality improvement. The constrained optimization model is converted to an unconstrained one and then solved by integrating chaos search and BFGS (Broyden-Fletcher-GoldfarbShanno) algorithm efficiently. Quality improvement for tetrahedral mesh is finally achieved by alternately applying the presented smoothing scheme and re-triangulation. Some testing examples are given to demonstrate the effectiveness of the proposed approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation

Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing "bad" triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In ...

متن کامل

Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations

The centroidal Voronoi tessellation based Delaunay triangulation (CVDT) provides an optimal distribution of generating points with respect to a given density function and accordingly generates a high-quality mesh. In this paper, we discuss algorithms for the construction of the constrained CVDT from an initial Delaunay tetrahedral mesh of a three-dimensional domain. By establishing an appropria...

متن کامل

3-D Automatic Mesh Generation for FEA Using Dynamic Bubble System

|In this paper, an extension of the previously developed 2-D dynamic bubble system for 3-D automatic mesh generation using tetrahedral nite elements is presented. Initially, set of vertices inside the entire analysis region is generated using 3-D dynamic bubble system, followed by automatic mesh generation according to the Delaunay tessellation algorithm and the generated set of vertices. The p...

متن کامل

Polyhedral Mesh Generation and Optimization for Non-manifold Domains

We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing the dual of a general tetrahedral mesh. The resulting mesh respects the topology of the domain to the same extent as the input mesh. If the input tetrahedral mesh is Delaunay and well-centered, the resulting mesh is a Voronoi mesh with planar faces. For general tetrahe...

متن کامل

Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation

This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consiste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013